WORST_CASE(?,O(n^1))

Solution:
---------

  "0" :: [] -(0)-> "A"(0)
  "Cons" :: ["A"(0) x "A"(8)] -(8)-> "A"(8)
  "Cons" :: ["A"(0) x "A"(6)] -(6)-> "A"(6)
  "Cons" :: ["A"(0) x "A"(7)] -(7)-> "A"(7)
  "Cons" :: ["A"(0) x "A"(0)] -(0)-> "A"(0)
  "False" :: [] -(0)-> "A"(13)
  "Nil" :: [] -(0)-> "A"(6)
  "Nil" :: [] -(0)-> "A"(8)
  "Nil" :: [] -(0)-> "A"(7)
  "Nil" :: [] -(0)-> "A"(10)
  "S" :: ["A"(0)] -(0)-> "A"(0)
  "S" :: ["A"(0)] -(4)-> "A"(4)
  "True" :: [] -(0)-> "A"(13)
  "fold" :: ["A"(10) x "A"(15)] -(16)-> "A"(0)
  "foldl" :: ["A"(4) x "A"(8)] -(4)-> "A"(3)
  "foldr" :: ["A"(1) x "A"(6)] -(6)-> "A"(0)
  "notEmpty" :: ["A"(7)] -(13)-> "A"(3)
  "op" :: ["A"(0) x "A"(0)] -(1)-> "A"(0)


Cost Free Signatures:
---------------------

  "0" :: [] -(0)-> "A"_cf(0)
  "Cons" :: ["A"_cf(0) x "A"_cf(0)] -(0)-> "A"_cf(0)
  "Nil" :: [] -(0)-> "A"_cf(0)
  "S" :: ["A"_cf(0)] -(0)-> "A"_cf(0)
  "foldl" :: ["A"_cf(0) x "A"_cf(0)] -(0)-> "A"_cf(0)
  "foldr" :: ["A"_cf(0) x "A"_cf(0)] -(0)-> "A"_cf(0)
  "op" :: ["A"_cf(0) x "A"_cf(0)] -(0)-> "A"_cf(0)


Base Constructors:
------------------
  "\"0\"_A" :: [] -(0)-> "A"(1)
  "\"Cons\"_A" :: ["A"(0) x "A"(1)] -(1)-> "A"(1)
  "\"False\"_A" :: [] -(0)-> "A"(1)
  "\"Nil\"_A" :: [] -(0)-> "A"(1)
  "\"S\"_A" :: ["A"(0)] -(1)-> "A"(1)
  "\"True\"_A" :: [] -(0)-> "A"(1)